Covering matrices of a graph
نویسنده
چکیده
Given a Graph G = ((V(G),E(G)), and a subset ) (G V S , S with a given property(covering set, Dominating set, Neighbourhood set), we define a matrix taking a row for each of the minimal set corresponding to the given property and a column for each of the vertex of G. The elements of the matrix are 1 or 0 respectively as the vertex is contained in minimal set or otherwise. That is matrix (mij) has elements mij and mij = 1 if i th row minimal set contains j vertex = 0 otherwise This paper initiates a study on these new types of matrices of a graph and we characterize such matrices for some special classes of graphs.
منابع مشابه
The topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملCentric connectivity index by shell matrices
Relative centricity RC values of vertices/atoms are calculated within the Distance Detour and Cluj-Distance criteria on their corresponding Shell transforms. The vertex RC distribution in a molecular graph gives atom equivalence classes, useful in interpretation of NMR spectra. Timed by vertex valences, RC provides a new index, called Centric Connectivity CC, which can be useful in the topologi...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملk-Neighborhood Covering and Independence Problems
15. J. P. Spinrad, \Doubly lexical ordering of dense 0-1 matrices," preprint. 16. J. Wu, \Neighborhood covering and neighborhood independence in strongly chordal graphs," preprint.
متن کامل